Free convolution is the free probability analog of the classical notion of convolution of probability measures. Due to the non-commutative nature of free probability theory, one has to talk separately about additive and multiplicative free convolution, which arise from addition and multiplication of free random variables (see below; in the classical case, what would be the analog of free multiplicative convolution can be reduced to additive convolution by passing to logarithms of random variables).
The notion of free convolution was introduced by Voiculescu in early 80s in the papers [1] and [2].
Contents |
Let and be two probability measures on the real line, and assume that is a random variable with law and is a random variable with law . Assume finally that and are freely independent. Then the free additive convolution is the law of .
In many cases, it is possible to compute the probability measure explicitly by using complex-analytic techniques and the R-transform of the measures and .
Let and be two probability measures on the interval , and assume that is a random variable with law and is a random variable with law . Assume finally that and are freely independent. Then the free multiplicative convolution is the law of (or, equivalently, the law of .
A similar definition can be made in the case of laws supported on the unit circle .
Explicit computations of multiplicative free convolution can be carried out using complex-analytic techniques and the S-transform.
Through its applications to random matrices, free convolution has some strong connections with other works on G-estimation of Girko.
The applications in wireless communications, finance and biology have provided a useful framework when the number of observations is of the same order as the dimensions of the system.